A Monotonicity Property of Ratios of Symmetric Homogeneous Means
نویسنده
چکیده
We study a certain monotonicity property of ratios of means, which we call a strong inequality. These strong inequalities were recently shown to be related to the so-called relative metric. We also use the strong inequalities to derive new ordinary inequalities. The means studied are the extended mean value of Stolarsky, Gini’s mean and Seiffert’s mean.
منابع مشابه
The Monotonicity Results for the Ratio of Certain Mixed Means and Their Applications
We continue to adopt notations and methods used in the papers illustrated by Yang 2009, 2010 to investigate the monotonicity properties of the ratio of mixed two-parameter homogeneous means. As consequences of our results, the monotonicity properties of four ratios of mixed Stolarsky means are presented, which generalize certain known results, and some known and new inequalities of ratios of me...
متن کاملm-Projections involving Minkowski inverse and range symmetric property in Minkowski space
In this paper we study the impact of Minkowski metric matrix on a projection in the Minkowski Space M along with their basic algebraic and geometric properties.The relation between the m-projections and the Minkowski inverse of a matrix A in the minkowski space M is derived. In the remaining portion commutativity of Minkowski inverse in Minkowski Space M is analyzed in terms of m-projections as...
متن کاملSymmetric Monotone Embedding of Traffic Flow Networks with First-In-First-Out Dynamics
We study a flow network model for vehicular traffic that captures congestion effects at diverging junctions. Standard approaches which rely on monotonicity of the flow dynamics do not immediately apply to such first-in-first-out models. The network model nonetheless exhibits a mixed monotonicity property. Mixed monotonicity enables the original system to be embedded in a system of twice the dim...
متن کاملAccurate BABE Factorisation of Tridiagonal Matrices for Eigenproblems
Recently Fernando successfully resurrected a classical method for computing eigen vectors which goes back to the times of Cauchy This algorithm has been in the doldrums for nearly fty years because of a fundamental di culty highlighted by Wilkinson The algorithm is based on the solution of a nearly homogeneous system of equations J I z k ek zk for the approximate eigenvector z where is an eigen...
متن کامل